Classifiers, Verb Classifiers, and Verbal Categories
نویسندگان
چکیده
منابع مشابه
Internal Algebra Classifiers as Codescent Objects of Crossed Internal Categories
Inspired by recent work of Batanin and Berger on the homotopy theory of operads, a general monad-theoretic context for speaking about structures within structures is presented, and the problem of constructing the universal ambient structure containing the prescribed internal structure is studied. Following the work of Lack, these universal objects must be constructed from simplicial objects ari...
متن کاملA parametric model for predicting cut point of hydraulic classifiers
A new parametric model was developed for predicting cut point of hydraulic classifiers. The model directly uses operating parameters including pulp flowrate, feed particle size characteristics, pulp solids content, solid density and particles retention time in the classification chamber and also covers uncontrollable errors using calibration constants. The model applicability was first verified...
متن کاملEvaluation of Classifiers in Software Fault-Proneness Prediction
Reliability of software counts on its fault-prone modules. This means that the less software consists of fault-prone units the more we may trust it. Therefore, if we are able to predict the number of fault-prone modules of software, it will be possible to judge the software reliability. In predicting software fault-prone modules, one of the contributing features is software metric by which one ...
متن کاملCautious Classifiers
The evaluation and use of classifiers is based on the idea that a classifier is defined as a complete function from instances to classes. Even when probabilistic classifiers are used, these are ultimately converted into categorical classifiers that must choose one class (with more or less confidence) from a set of classes. Evaluation metrics such as accuracy/error, global cost, precision, recal...
متن کاملEvaluating Classifiers
In a real-world application of supervised learning, we have a training set of examples with labels, and a test set of examples with unknown labels. The whole point is to make predictions for the test examples. However, in research or experimentation we want to measure the performance achieved by a learning algorithm. To do this we use a test set consisting of examples with known labels. We trai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annual Meeting of the Berkeley Linguistics Society
سال: 2014
ISSN: 2377-1666,0363-2946
DOI: 10.3765/bls.v12i0.1847